Randomized Shortest-Path Problems: Two Related Models

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Shortest-Path Problems: Two Related Models

This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some...

متن کامل

Randomized Shortest-Path Problems: Two Seemingly Unrelated Models

Suppose you have to route agents through a network from a source node to a destination node in some optimal way; for instance by minimizing the total travel cost. Nothing new up to now – you could use a standard shortest-path algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some exploration of the network, to avoid congesti...

متن کامل

Randomized Shortest-Path Problems: A first study

Suppose you have to route agents through a network from a source node to a destination node in some optimal way; for instance by minimizing the total travel cost. Nothing new up to now – you could use a standard shortestpath algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some exploration of the network, to avoid congestio...

متن کامل

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Robust shortest path problems

This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neural Computation

سال: 2009

ISSN: 0899-7667,1530-888X

DOI: 10.1162/neco.2009.11-07-643